Obstacle - Avoiding Euclidean
نویسندگان
چکیده
The rst exact algorithm for the obstacle-avoiding Euclidean Steiner tree problem in the plane (in its most general form) is presented. The algorithm uses a two-phase framework | based on the generation and concatenation of full Steiner trees | previously shown to be very successful for the obstacle-free case. Computational results for moderate size problem instances are given; instances with up to 150 terminals have been solved to optimality within a few hours of CPU-time.
منابع مشابه
Designing Path for Robot Arm Extensions Series with the Aim of Avoiding Obstruction with Recurring Neural Network
In this paper, recurrent neural network is used for path planning in the joint space of the robot with obstacle in the workspace of the robot. To design the neural network, first a performance index has been defined as sum of square of error tracking of final executor. Then, obstacle avoidance scheme is presented based on its space coordinate and its minimum distance between the obstacle and ea...
متن کاملApproximate Point-to-Face Shortest Paths in R^3
We address the point-to-face approximate shortest path problem in R: Given a set of polyhedral obstacles with a total of n vertices, a source point s, an obstacle face f , and a real positive parameter ǫ, compute a path from s to f that avoids the interior of the obstacles and has length at most (1 + ǫ) times the length of the shortest obstacle avoiding path from s to f . We present three appro...
متن کاملOn the Geodesic Diameter in Polygonal Domains∗
A polygonal domain P with n corners V and h holes is a connected polygonal region of genus h whose boundary consists of h + 1 closed chains of n total line segments. The holes and the outer boundary of P are regarded as obstacles. Then, the geodesic distance d(p, q) between any two points p, q in polygonal domain P is defined to be the (Euclidean) length of a shortest obstacle-avoiding path bet...
متن کاملGeodesic Obstacle Representation of Graphs
An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-line segment connecting the points corresponding to two vertices does not intersect any obstacles if and only if the vertices are adjacent in the graph. The obstacle representation and its plane variant (in which the re...
متن کاملA smooth, obstacle-avoiding curve
An algorithm for finding a smooth, obstacle-avoiding curve in the plane can be quite complicated. The process usually involves finding one or more feasible polyline paths, choosing a desirable path (for example the shortest path), and smoothing the polyline path to give a curve that avoids the obstacles. This paper is concerned with the last stage in the process; it assumes the existence of an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999